An Improved Algorithm for the Nearly Equitable Edge-coloring Problem
نویسندگان
چکیده
A nearly equitable edge-coloring of a multigraph is a coloring such that edges incident to each vertex are colored equitably in number. This problem was solved in O(kn2) time, where n and k are the numbers of the edges and the colors, respectively. The running time was improved to be O(n2/k + n|V |) later. We present a more efficient algorithm for this problem that runs in O(n2/k) time. key words: nearly equitable edge coloring, Euler circuit
منابع مشابه
An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem
An edge coloring of a multigraph is nearly equitable if, among the edges incident to each vertex, the numbers of edges colored with any two colors differ by at most two. It has been proved that the problem of finding a nearly equitable edge coloring can be solved in O(m/k) time, where m and k are the numbers of edges and given colors, respectively. In this paper, we present a recursive algorith...
متن کاملA Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previous algorithms. The coloring computed by our algorithm satisfies additional balanced conditions on the number of edges used in each color class, where conditions are imposed on the balance among all edges in the multig...
متن کاملMinimum Reload Cost Cycle Cover in Complete Graphs
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al. [1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. They proved that this problem is strongly NP-hard and not appro...
متن کاملEquitable edge coloured Steiner triple systems
A k-edge coloring of G is said to be equitable if the number of edges, at any vertex, colored with a certain color differ by at most one from the number of edges colored with a different color at the same vertex. An STS(v) is said to be polychromatic if the edges in each triple are colored with three different colors. In this paper, we show that every STS(v) admits a 3-edge coloring that is bot...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003